# 3-3-9 degree method

- 3-3-9分级法(日本的昏迷分级法)

*Medical Chinese dictionary (湘雅医学词典).
2013.*

### Look at other dictionaries:

**Method of conditional probabilities**— In mathematics and computer science, the probabilistic method is used to prove the existence of mathematical objects with desired combinatorial properties. The proofs are probabilistic they work by showing that a random object, chosen from some… … Wikipedia**Method engineering**— Not to be confused with Methods engineering, a subspecialty of Industrial engineering Example of a Method Engineering Process. This figure provides a process oriented view of the approach used to develop prototype IDEF9 method concepts, a… … Wikipedia**Degree symbol**— This article describes the typographical or mathematical symbol. For other meanings, see Degree. ° Degree symbol Punctuation … Wikipedia**Method of loci**— The method of loci (plural of Latin locus for place or location), also called the memory palace, is a mnemonic device introduced in ancient Roman rhetorical treatises (in the anonymous Rhetorica ad Herennium, Cicero s De Oratore, and Quintilian s … Wikipedia**Method of characteristics**— In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first order equations, although more generally the method of characteristics is valid for any hyperbolic partial… … Wikipedia**Method of undetermined coefficients**— In mathematics, the method of undetermined coefficients, also known as the lucky guess method, is an approach to finding a particular solution to certain inhomogeneous ordinary differential equations and recurrence relations. It is closely… … Wikipedia**method**— The mode or manner or orderly sequence of events of a process or procedure. SEE ALSO: fixative, operation, procedure, stain, technique. [G. methodos; fr. meta, after, + hodos, way] Abell Kendall m. a … Medical dictionary**Degree of truth**— In standard mathematics, propositions can typically be considered unambiguously true or false. For instance, the proposition zero belongs to the set { 0 } is regarded as simply true; while the proposition one belongs to the set { 0 } is regarded… … Wikipedia**Turing degree**— Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia**Durand–Kerner method**— In numerical analysis, the Durand–Kerner method established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root finding algorithm for… … Wikipedia**Discharging method (discrete mathematics)**— The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the proof of the Four Color Theorem. The discharging method is used to prove that every graph in a… … Wikipedia